package jjn.round1;

import commons.TreeNode;

/**
 * @author Jjn
 * @since 2022-08-01 14:12
 */
public class LeetCode617_MergeTwoBinaryTrees {
    
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root2 == null) {
            return root1;
        }
        if (root1 == null) {
            return root2;
        }
        TreeNode node = new TreeNode(root1.val + root2.val);
        node.left = mergeTrees(root1.left, root2.left);
        node.right = mergeTrees(root1.right, root2.right);
        return node;
    }
}
